Geodesic Distances on Density Matrices
نویسنده
چکیده
We find an upper bound for geodesic distances associated to monotone Riemannian metrics on positive definite matrices and density matrices.
منابع مشابه
Riemannian Metric Learning for Symmetric Positive Definite Matrices
Over the past few years, symmetric positive definite matrices (SPD) have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the two most widely-used measures are affine-invariant distance and log-Euclidean distance. This is because these two measures are true geodesic distances induced...
متن کاملApproximating Geodesic Distances on 2-Manifolds in R3
We present an algorithm for approximating geodesic distances on 2-manifolds in R. Our algorithm works on an ε-sample of the underlying manifold and computes approximate geodesic distances between all pairs of points in this sample. The approximation error is multiplicative and depends on the density of the sample. For an ε-sample S, the algorithm has a near-optimal running time of O ( |S| log |...
متن کاملRiemannian metrics on positive definite matrices related to means. II
On the manifold of positive definite matrices, a Riemannian metric Kφ is associated with a positive kernel function φ on (0,∞) × (0,∞) by defining K D(H,K) = ∑ i,j φ(λi, λj) TrPiHPjK, where D is a foot point with the spectral decomposition D = ∑ i λiPi and H,K are Hermitian matrices (tangent vectors). We are concerned with the case φ(x, y) = M(x, y)θ where M(x, y) is a mean of scalars x, y > 0....
متن کاملLeast-Squares on the Real Symplectic Group
The present paper discusses the problem of least-squares over the real symplectic group of matrices Sp(2n,R). The least-squares problem may be extended from flat spaces to curved spaces by the notion of geodesic distance. The resulting non-linear minimization problem on manifold may be tackled by means of a gradient-descent algorithm tailored to the geometry of the space at hand. In turn, gradi...
متن کاملSparse and low-rank approximations of large symmetric matrices using biharmonic interpolation
Geodesic distance matrices can reveal shape properties that are largely invariant to non-rigid deformations, and thus are often used to analyze and represent 3-D shapes. However, these matrices grow quadratically with the number of points. Thus for large point sets it is common to use a low-rank approximation to the distance matrix, which fits in memory and can be efficiently analyzed using met...
متن کامل